1471A - Strange Partition - CodeForces Solution

greedy math number theory *900

Please click on ads to support us..

Python Code: 

from math import ceil
T = int(input())
 
for case in range(T):
    n, x = map(int, input().split())
    a = list(map(int, input().split()))
    
    min = ceil(sum(a)/x)
    max = 0
    for i in a:
        max += ceil(i/x)
    print(min, max)

C++ Code: 

/* author:prasad patil
   codeforces:rocklee07
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long 
void prasad()
{
    ll n,x; cin>>n>>x;
    vector<ll>v(n);
    for(ll i=0;i<n;i++) cin>>v[i];
    ll mx=0,mn=0;
    for(ll i=0;i<n;i++)
    {
        if((v[i]%x)!=0)
        {
            mx+=((v[i]/x)+1);
        }
        else
        {
            mx+=(v[i]/x);
        }
    }
    ll temp=0;
    for(ll i=0;i<n;i++)
    {
        temp+=(v[i]%x);
        mn+=(v[i]/x);
    }
    mn+=(temp/x);
    if((temp%x)!=0) mn++;
    cout<<mn<<" "<<mx<<endl;
}           

int main()
{
          ios_base::sync_with_stdio(false);
      cin.tie(NULL); cout.tie(NULL);
          ll t; cin>>t;
          while(t--)
          {
            prasad();
          }
          return 0;
}


Comments

Submit
0 Comments
More Questions

230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns